Utilisation of pruned Pareto-optimal solutions in the multi objective optimisation: an application to system redundancy allocation problems
نویسندگان
چکیده
Multi-objective optimisation problems normally have not one but a set of solutions, which are called Pareto-optimal solutions or non-dominated solutions. Once a Pareto-optimal set has been obtained, the decision-maker faces the challenge of analysing a potentially large set of solutions. Selecting one solution over others can be quite a challenging task because the Pareto set can contain an unmanageable number of solutions. This process is called post-Pareto optimality analysis. To deal with this difficulty, this study proposes the approach that promisingly prunes the Pareto optimal set. In this study, the newly developed approach uses Monte-Carlo simulation taking into account the decision maker’s prioritisation to prune the Pareto optimal set. Then, the central weight vector, the optimal frequently appearance index and upper and lower bands of weights are enclosed to each solution to facilitate selecting a final solution. The well-known redundancy allocation problem is used to show the performance of the proposed method.
منابع مشابه
Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
متن کاملPruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
Multi-objective problems are often solved by modifying them into equivalent single objective problems using pre-defined weights or utility functions. Then, a multi-objective problem is solved similar to a single objective problem returning a single solution. These methods can be problematic because assigning appropriate numerical values (i.e., weights) to an objective function can be challengin...
متن کاملA New Nonlinear Multi-objective Redundancy Allocation Model with the Choice of Redundancy Strategy Solved by the Compromise Programming Approach
One of the primary concerns in any system design problem is to prepare a highly reliable system with minimum cost. One way to increase the reliability of systems is to use redundancy in different forms such as active or standby. In this paper, a new nonlinear multi- objective integer programming model with the choice of redundancy strategy and component type is developed where standby strategy ...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJADS
دوره 6 شماره
صفحات -
تاریخ انتشار 2013